Estimating Rigid Transformation Between Two Range Maps Using Expectation Maximization Algorithm
نویسنده
چکیده
Rigid registration of two sets of points sampled from a surface has been widely investigated (e.g., [1], [4]–[6], [9]) in computer vision literature. Generally, these methods are designed to tackle range maps with dense points for non-realtime applications. In [2], [8] scans are matched using iterative closest line (ICL), a variant of “normal-distance” form of ICP algorithm [1] originally proposed in computer vision community by [3]. However, the convergence of this approach is sensitive to errors in normal direction estimations [10].
منابع مشابه
Handling Missing Data in the Computation of 3D Affine Transformations
The reconstruction of rigid scenes from multiple images is a central topic in computer vision. Approaches merging partial 3D models in a hierarchical manner have proven the most effective to deal with large image sequences. One of the key building blocks of these hierarchical approaches is the alignment of two partial 3D models, which requires to express them in the same 3D coordinate frame by ...
متن کاملAlignement de reconstructions tridimensionnelles affines en présence de données images manquantes Handling Missing Data in the Computation of 3D Affine Transformations
The reconstruction of rigid scenes from multiple images is a central topic in computer vision. Approaches merging partial 3D models in a hierarchical manner have proven the most effective to deal with large image sequences. One of the key building blocks of these hierarchical approaches is the alignment of two partial 3D models, which requires to express them in the same 3D coordinate frame by ...
متن کاملLearning occupancy grids with forward models
This paper presents a new way to acquire occupancy grid maps with mobile robots. Virtually all existing occupancy grid mapping algorithms decompose the highdimensional mapping problem into a collection of onedimensional problems, where the occupancy of each grid cell is estimated independently of others. This induces conflicts that can lead to inconsistent maps. This paper shows how to solve th...
متن کاملRigid Point Registration with Expectation Conditional Maximization
This paper addresses the issue of matching rigid 3D object points with 2D image points through point registration based on maximum likelihood principle in computer simulated images. Perspective projection is necessary when transforming 3D coordinate into 2D. The problem then recasts into a missing data framework where unknown correspondences are handled via mixture models. Adopting the Expectat...
متن کاملMaximum Likelihood Parameter Estimation
The problem of estimating the parameters for continuous-time partially observed systems is discussed. New exact lters for obtaining Maximum Likelihood (ML) parameter estimates via the Expectation Maximization algorithm are derived. The methodology exploits relations between incomplete and complete data likelihood and gradient of likelihood functions, which are derived using Girsanov's measure t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.0067 شماره
صفحات -
تاریخ انتشار 2012